On the set of catenary degrees of finitely generated cancellative commutative monoids
نویسندگان
چکیده
منابع مشابه
On the set of catenary degrees of finitely generated cancellative commutative monoids
The catenary degree of an element s of a cancellative commutative monoid S is a nonnegative integer measuring the distance between the irreducible factorizations of s. The catenary degree of the monoid S, defined as the supremum over all catenary degrees occurring in S, has been heavily studied as an invariant of nonunique factorization. In this paper, we investigate the set C(S) of catenary de...
متن کاملThe Catenary and Tame Degree in Finitely Generated Commutative Cancellative Monoids
A. Problems involving chains of irreducible factorizations in atomic integral domains and monoids have been the focus of much recent literature. If S is a commutative cancellative atomic monoid, then the catenary degree of S (denoted c(S )) and the tame degree of S (denoted t(S )) are combinatorial invariants of S which describe the behavior of chains of factorizations. In this note, we ...
متن کاملThe catenary and tame degree in finitely generated commutative cancellative monoids
Problems involving chains of irreducible factorizations in atomic integral domains and monoids have been the focus of much recent literature. If S is a commutative cancellative atomic monoid, then the catenary degree of S (denoted c(S)) and the tame degree of S (denoted t(S)) are combinatorial invariants of S which describe the behavior of chains of factorizations. In this note, we describe met...
متن کاملPrimary ideals of finitely generated commutative cancellative monoids
We give a characterization of primary ideals of finitely generated commutative monoids and in the case of finitely generated cancellative monoids we give an algorithmic method for deciding if an ideal is primary or not. Finally we give some properties of primary elements of a cancellative monoid and an algorithmic method for determining the primary elements of a finitely generated cancellative ...
متن کاملPresentations of Finitely Generated Submonoids of Finitely Generated Commutative Monoids
We give an algorithmic method for computing a presentation of any finitely generated submonoid of a finitely generated commutative monoid. We use this method also for calculating the intersection of two congruences on Np and for deciding whether or not a given finitely generated commutative monoid is t-torsion free and/or separative. The last section is devoted to the resolution of some simple ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2016
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196716500247